Turing Test Considered Harmful
نویسندگان
چکیده
Passing the Turing Test is not a sensible goal for Artificial Intelligence. Adherence to Turing's vision from 1950 is now actively harmful to our field. We review problems with Turing's idea, and suggest that, ironically, the very cognitive science that he tried to create must reject his research goal.
منابع مشابه
Turing Test Considered Harmful (IJCAI -1995 invited talk)
Passing the Turing Test is not a sensible goal for Artificial Intelligence. Adherence to Turing’s vision from 1950 is now actively harmful to our field. We review problems with Turing’s idea, and suggest that, ironically, the very cognitive science that he tried to create must reject his research goal.
متن کاملTuring Completeness Considered Harmful: Component Programming with a Simple Language
Languages are increasingly being used to reuse computations as components as well as to express these computations in the first place. However, the expression of computations and component assembly have opposing language requirements: the former requires flexible Turing-complete constructs that can express many interactions while the latter benefits from constructs that instead hide interaction...
متن کاملProlegomena to any future artificial moral agent
As arti® cial intelligence moves ever closer to the goal of producing fully autonomous agents, the question of how to design and implement an arti ® cial moral agent (AMA) becomes increasingly pressing. Robots possessing autonomous capacities to do things that are useful to humans will also have the capacity to do things that are harmful to humans and other sentient beings. Theoretical challeng...
متن کاملPluggable Type Systems
Traditionally, statically typed programming languages incorporate a built-in static type system. This system is typically mandatory: every legal program must successfully typecheck according to the rules of the type system. In contrast, optional type systems are neither syntactically nor semantically required, and have no effect on the dynamic semantics of the language. This in turn enables plu...
متن کاملCombinatorial Lower Bound Arguments for Deterministic and Nondeterministic Turing Machines
We introduce new techniques for proving quadratic lower bounds for deterministic and nondeterministic 1-tape Turing machines (all considered Turing machines have an additional one-way input tape). In particular, we derive for the simulation of 2-tape Turing machines by 1-tape Turing machines an optimal quadratic lower bound in the deterministic case and a nearly optimal lower bound in the nonde...
متن کامل